Integrity processing in a dispersed storage network

ABSTRACT

A distributed storage integrity system in a dispersed storage network includes a scanning agent and a control unit. The scanning agent identifies an encoded data slice that requires rebuilding, wherein the encoded data slice is one of a plurality of encoded data slices generated from a data segment using an error encoding dispersal function. The control unit retrieves at least a number T of encoded data slices needed to reconstruct the data segment based on the error encoding dispersal function. The control unit is operable to reconstruct the data segment from at least the number T of the encoded data slices and generate a rebuilt encoded data slice from the reconstructed data segment. The scanning agent is located in a storage unit and the control unit is located in the storage unit or in a storage integrity processing unit, a dispersed storage processing unit or a dispersed storage managing unit.

CROSS-REFERENCE TO RELATED PATENTS

The present U.S. Utility Patent application claims priority pursuant to35 U.S.C. § 120 as a continuation of U.S. Utility application Ser. No.15/612,243, entitled “Method And Apparatus For Distributed StorageIntegrity Processing”, filed Jun. 2, 2017, which is a continuation ofU.S. Utility application Ser. No. 14/331,997, entitled “Method AndApparatus For Distributed Storage Integrity Processing”, filed Jul. 15,2014, issued as U.S. Pat. No. 9,785,503 on Oct. 10, 2017, which is acontinuation of U.S. Utility application Ser. No. 14/047,661, entitled“Method And Apparatus For Distributed Storage Integrity Processing”,filed Oct. 7, 2013, issued as U.S. Pat. No. 8,819,482 on Aug. 26, 2014,which is a continuation of U.S. Utility application Ser. No. 12/767,364,entitled “Method And Apparatus For Distributed Storage IntegrityProcessing”, filed Apr. 26, 2010, issued as U.S. Pat. No. 8,555,109 onOct. 8, 2013, all of which are hereby incorporated herein by referencein their entirety and made part of the present U.S. Utility PatentApplication for all purposes.

U.S. patent application Ser. No. 12/767,364 also claims priority under35 U.S.C. § 120 as a continuation-in-part application to U.S. patentapplication Ser. No. 12/716,106, entitled “Method And Apparatus ForRebuilding Data In A Dispersed Data Storage Network,” filed Mar. 2,2010, issued as U.S. Pat. No. 8,560,882 on Oct. 15, 2013.

U.S. patent application Ser. No. 12/767,364 also claims priority under35 U.S.C. § 119(e) to U.S. Provisional Application No. 61/230,034,entitled “Dispersed Storage Network Data Rebuilding,” filed Jul. 30,2009.

U.S. Utility patent application Ser. No. 14/331,997 also claims prioritypursuant to 35 U.S.C. § 120 as a continuation-in-part of U.S. Utilityapplication Ser. No. 13/863,475, entitled “Dispersed Storage WriteProcess,” filed Apr. 16, 2013, issued as U.S. Pat. No. 9,092,140 on Jul.28, 2015, which is a continuation of U.S. Utility application Ser. No.12/797,025, entitled “Dispersed Storage Write Process,” filed Jun. 9,2010, issued as U.S. Pat. No. 8,595,435 on Nov. 26, 2013, which claimspriority pursuant to 35 U.S.C. § 119(e) to U.S. Provisional ApplicationNo. 61/230,038, entitled “Dispersed Storage Network VersionSynchronization,” filed Jul. 30, 2009.

U.S. Utility application Ser. No. 13/863,475 also claims prioritypursuant to 35 U.S.C. § 120 as a continuation-in-part of U.S. Utilityapplication Ser. No. 12/080,042, entitled, “Rebuilding Data On ADispersed Storage Network,” filed Mar. 31, 2008, issued as U.S. Pat. No.8,880,799 on Nov. 4, 2014, which is a continuation-in-part of U.S.Utility application Ser. No. 11/973,542, entitled “Ensuring DataIntegrity On A Dispersed Storage Grid,” filed Oct. 9, 2007, issued asU.S. Pat. No. 9,996,413 on Jun. 12, 2018; and is a continuation-in-partof U.S. Utility application Ser. No. 11/403,391, entitled “System ForRebuilding Dispersed Data,” filed Apr. 13, 2006, issued as U.S. Pat. No.7,546,427 on Jun. 9, 2009, which is a continuation-in-part of U.S.Utility application Ser. No. 11/241,555, entitled “Systems, Methods, AndApparatus For Subdividing Data For Storage In A Dispersed Data StorageGrid,” filed Sep. 30, 2005, issued as U.S. Pat. No. 7,953,937 on May 31,2011.

STATEMENT REGARDING FEDERALLY SPONSORED RESEARCH OR DEVELOPMENT

Not Applicable

INCORPORATION-BY-REFERENCE OF MATERIAL SUBMITTED ON A COMPACT DISC

Not Applicable

BACKGROUND OF THE INVENTION Technical Field of the Invention

This invention relates generally to computing systems and moreparticularly to data storage within such computing systems.

Description of Related Art

Computing systems are known to communicate, process, and store data.Such computing systems range from wireless smart phones to data centersthat support millions of web searches, stock trades, or on-linepurchases every day. Computing processing is known to manipulate datafrom one form into another. For instance, raw picture data from an imagesensor may be compressed and/or manipulated in accordance with a picturecompression standard to produce a standardized compressed picture thatcan be saved or shared with others.

With continued advances in computing processing speed and communicationspeed, computers manipulate real time media from voice to streaming highdefinition video. As such, general-purpose information appliances arereplacing purpose-built communications devices (e.g., a telephone). Forexample, smart phones can support telephony communications but they arealso capable of text messaging and accessing the internet to performfunctions including email, web browsing, remote applications access, andmedia communications (e.g., telephony voice, image transfer, musicfiles, video files, real time video streaming, etc.).

Each type of computing system is constructed, and hence operates, inaccordance with one or more communication, processing, and storagestandards. As a result of standardization and with advances intechnology, more and more information content is being converted intodigital formats. For example, more digital cameras are now being soldthan film cameras, thus producing more digital pictures. As anotherexample, web-based programming is becoming an alternative to over theair television broadcasts and/or cable broadcasts. As further examples,papers, books, video entertainment, home video, etc. are now beingstored digitally which increases the demand on the storage function ofcomputing systems.

A typical computer storage function includes one or more memory devicesaligned with the needs of the various operational aspects of thecomputer system's processing and communication functions. Generally, theimmediacy of access dictates what type of memory device is used. Forexample, random access memory (RAM) memory can be accessed in any randomorder with a constant response time, thus it is typically used for cachememory and main memory. By contrast, memory device technologies thatrequire physical movement such as magnetic disks, tapes, and opticaldiscs, have a variable response time as the physical movement can takelonger than the data transfer, thus are typically used for secondarymemory (e.g., hard drive, backup memory, etc.).

Computer system storage standards include, but are not limited to,network file system (NFS), flash file system (FFS), disk file system(DFS), small computer system interface (SCSI), internet small computersystem interface (iSCSI), file transfer protocol (FTP), and web-baseddistributed authoring and versioning (WebDAV). Such standards specifythe data storage format (e.g., files, data objects, data blocks,directories, etc.) and interface between the computer system'sprocessing function and the memory devices. Typically a memorycontroller provides the interface function between the processingfunction and the memory devices and will have to change as new storagesystems are developed.

Despite the standardization of the computer system and its memory,memory devices fail; especially commercial grade memory devices thatutilize technologies incorporating physical movement (e.g., a discdrive). For example, it is fairly common for a disc drive to routinelysuffer from bit level corruption and to completely fail after threeyears of use. One solution is to a higher-grade disc drive, which addssignificant cost to the computing system.

Another solution is to utilize multiple levels of redundant disc drivesto replicate the data into two or more copies. One such redundant driveapproach is called redundant array of independent discs (RAID). In aRAID device, a RAID controller adds parity data to the original databefore storing it across the array. The parity data is calculated fromthe original data such that the failure of one or more discs will notresult in the loss of the original data. For example, RAID 5 uses threediscs to protect data from the failure of a single disc. The paritydata, and associated redundancy overhead data, reduces the storagecapacity of three independent discs by one third (e.g., n−1=capacity).RAID 6 can recover from a loss of two discs and requires a minimum offour discs with a storage capacity of n−2.

While RAID addresses the memory device failure issue, it is not withoutits own failures issues that affect its effectiveness, efficiency andsecurity. For instance, as more discs are added to the array, theprobability of a disc failure increases, which increases the demand formaintenance. For example, when a disc fails, it needs to be manuallyreplaced before another disc fails and the data stored in the RAIDdevice is lost. To reduce the risk of data loss, data on a RAID deviceis typically copied on to one or more other RAID devices. While thisaddresses the loss of data issue, it raises a security issue sincemultiple copies of data are available, which increases the chances ofunauthorized access. Further, as the amount of data being stored grows,the overhead of RAID devices becomes a non-trivial efficiency issue.

Therefore, a need exists for a data storage solution that provides morereliable storage of data, minimizes adverse affects of multiple memoryelements failures, provides improved security, is adaptable to a widevariety of storage system standards, and/or is compatible with computingand communications systems.

BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS

FIG. 1 is a schematic block diagram of an embodiment of a computingsystem for dispersed storage in accordance with the invention;

FIG. 2 is a schematic block diagram of an embodiment of a computing corein accordance with the invention;

FIG. 3 is a schematic block diagram of an embodiment of a storageintegrity processing unit in accordance with the invention;

FIG. 4 is a schematic block diagram of an embodiment of a grid module inaccordance with the invention;

FIG. 5 is a diagram of an example embodiment of error coded data slicecreation in accordance with the invention;

FIG. 6 is a diagram of an example embodiment of a distributed storage(DS) processing unit in accordance with the invention;

FIG. 7 is a schematic block diagram of an embodiment of a file systemhierarchy in accordance with the invention;

FIG. 8 is a schematic block diagram of an embodiment of a method fordata rebuilding in accordance with the present invention;

FIG. 9 is a logic flow diagram of an embodiment of a method for datarebuilding in accordance with the present invention;

FIG. 10 is a logic flow diagram of another embodiment of a method fordata rebuilding in accordance with the present invention;

FIG. 11 is a logic flow diagram of another embodiment of a method fordata rebuilding in accordance with the present invention;

FIG. 12 is a logic flow diagram of another embodiment of a method fordata rebuilding in accordance with the present invention;

FIG. 13 is a schematic block diagram of another embodiment of a gridmodule in accordance with the invention;

FIG. 14 is a logic flow diagram of another embodiment for datarebuilding in accordance with the present invention;

FIG. 15 is a schematic block diagram of an embodiment of a control unitin accordance with the invention;

FIG. 16 is a logic flow diagram of an embodiment of a method forscanning in accordance with the present invention;

FIG. 17 is a logic flow diagram of another embodiment of a method forscanning in accordance with the present invention;

FIG. 18 is a logic flow diagram of another embodiment of a method forscanning in accordance with the present invention;

FIG. 19 is a logic flow diagram of another embodiment of a method forscanning in accordance with the present invention;

FIG. 20 is a logic flow diagram of another embodiment for datarebuilding in accordance with the present invention;

FIG. 21 is a logic flow diagram of another embodiment for datarebuilding in accordance with the present invention;

FIG. 22A is a schematic block diagram of another embodiment of adistributed control unit in accordance with the invention;

FIG. 22B is a schematic block diagram of another embodiment of adistributed control unit in accordance with the invention;

FIG. 23 is a schematic block diagram of another embodiment of adistributed storage network in accordance with the invention;

FIG. 24 is a diagram of an embodiment of a distributed storage memorymapping in accordance with the invention;

FIG. 25 is a schematic block diagram of another embodiment of adistributed storage network in accordance with the invention;

FIG. 26 is a schematic block diagram of another embodiment of datarebuilding in accordance with the invention;

FIG. 27 is a schematic block diagram of another embodiment of datarebuilding in accordance with the invention;

FIG. 28 is a schematic block diagram of another embodiment of datarebuilding in accordance with the invention;

FIG. 29 is a schematic block diagram of another embodiment of datarebuilding in accordance with the invention;

FIG. 30 is a schematic block diagram of another embodiment of datarebuilding in accordance with the invention;

FIG. 31 is a schematic block diagram of another embodiment of datarebuilding in accordance with the invention;

FIG. 32 is a schematic block diagram of another embodiment of datarebuilding in accordance with the invention; and

FIG. 33 is a logic flow diagram of another embodiment for datarebuilding in accordance with the present invention.

DETAILED DESCRIPTION OF THE INVENTION

FIG. 1 is a schematic block diagram of a computing system 10 fordispersed storage that includes one or more of a first type of userdevices 12, one or more of a second type of user device 14, at least onedistributed storage (DS) processing unit 16, at least one DS managingunit 18, at least one storage integrity processing unit 20, and adistributed storage network (DSN) memory 22 coupled via a network 24.The network 24 may include one or more wireless and/or wire linedcommunication systems; one or more private intranet systems and/orpublic internet systems; and/or one or more local area networks (LAN)and/or wide area networks (WAN).

The DSN memory 22 includes a plurality of DS storage units 36 forstoring data of in the computing system 10. Each of the DS storage units36 includes a processing module and memory and may be located atgeographically different sites (e.g., one in Chicago, one in Milwaukee,etc.). The processing module may be a single processing device or aplurality of processing devices. Such a processing device may be amicroprocessor, micro-controller, digital signal processor,microcomputer, central processing unit, field programmable gate array,programmable logic device, state machine, logic circuitry, analogcircuitry, digital circuitry, and/or any device that manipulates signals(analog and/or digital) based on hard coding of the circuitry and/oroperational instructions. The processing module may have an associatedmemory and/or memory element, which may be a single memory device, aplurality of memory devices, and/or embedded circuitry of the processingmodule. Such a memory device may be a read-only memory, random accessmemory, volatile memory, non-volatile memory, static memory, dynamicmemory, flash memory, cache memory, and/or any device that storesdigital information. Note that if the processing module includes morethan one processing device, the processing devices may be centrallylocated (e.g., directly coupled together via a wired and/or wireless busstructure) or may be distributedly located (e.g., cloud computing viaindirect coupling via a local area network and/or a wide area network).Further note that when the processing module implements one or more ofits functions via a state machine, analog circuitry, digital circuitry,and/or logic circuitry, the memory and/or memory element storing thecorresponding operational instructions may be embedded within, orexternal to, the circuitry comprising the state machine, analogcircuitry, digital circuitry, and/or logic circuitry. Still further notethat, the memory element stores, and the processing module executes,hard coded and/or operational instructions corresponding to at leastsome of the steps and/or functions illustrated in FIGS. 1-24.

Each of the user devices 12, 14, the DS processing unit 16, the DSmanaging unit 18, and the storage integrity processing unit 20 may be aportable computing device (e.g., a social networking device, a gamingdevice, a cell phone, a smart phone, a personal digital assistant, adigital music player, a digital video player, a laptop computer, ahandheld computer, a video game controller, and/or any other portabledevice that includes a computing core) and/or a fixed computing device(e.g., a personal computer, a computer server, a cable set-top box, asatellite receiver, a television set, a printer, a fax machine, homeentertainment equipment, a video game console, and/or any type of homeor office computing equipment). Such a portable or fixed computingdevice includes a computing core 26 and one or more interfaces 30, 32,and/or 33. An embodiment of the computing core 26 will be described withreference to FIG. 2.

With respect to the interfaces, each of the interfaces 30, 32, and 33includes software and/or hardware to support one or more communicationlinks via the network 24 and/or directly. For example, interfaces 30support a communication link (wired, wireless, direct, via a LAN, viathe network 24, etc.) between the first type of user device 14 and theDS processing unit 16. As another example, DSN interface 32 supports aplurality of communication links via the network 24 between the DSNmemory 22 and the DS processing unit 16, the first type of user device12, and/or the storage integrity processing unit 20. As yet anotherexample, interface 33 supports a communication link between the DSmanaging unit 18 and any one of the other devices and/or units 12, 14,16, 20, and/or 22 via the network 24.

In general, the computing system 10 supports three primary functions:distributed network data storage management, distributed data storageand retrieval, and data storage integrity verification. In accordancewith these three primary functions, data can be distributedly stored ina plurality of physically different locations and subsequently retrievedin a reliable and secure manner despite failures of individual storagedevices, failures of network equipment, the duration of storage, theamount of data being stored, unauthorized attempts to access the data,etc.

The DS managing unit 18 performs the distributed network data storagemanagement functions, which include establishing distributed datastorage parameters, performing network operations, performing networkadministration, and/or performing network maintenance. The DS managingunit 18 establishes the distributed data storage parameters (e.g.,allocation of virtual DSN memory space, distributed storage parameters,security parameters, billing information, user profile information,etc.) for one or more of the user devices 12-14 (e.g., established forindividual devices, established for a user group of devices, establishedfor public access by the user devices, etc.). For example, the DSmanaging unit 18 coordinates the creation of a vault (e.g., a virtualmemory block) within the DSN memory 22 for a user device (for a group ofdevices, or for public access). The DS managing unit 18 also determinesthe distributed data storage parameters for the vault. In particular,the DS managing unit 18 determines a number of slices (e.g., the numberthat a data segment of a data file and/or data block is partitioned intofor distributed storage) and a threshold value (e.g., the minimum numberof slices required to reconstruct the data segment).

As another example, the DS managing module 18 may create and storelocally or within the DSN memory 22 user profile information. The userprofile information includes one or more of authentication information,permissions, and/or the security parameters. The security parameters mayinclude one or more of encryption/decryption scheme, one or moreencryption keys, key generation scheme, and data encoding/decodingscheme.

As yet another example, the DS managing unit 18 may create billinginformation for a particular user, user group, vault access, publicvault access, etc. For instance, the DS managing unit 18 may track thenumber of times user accesses a private vault and/or public vaults,which can be used to generate a per-access bill. In another instance,the DS managing unit 18 tracks the amount of data stored and/orretrieved by a user device and/or a user group, which can be used togenerate a per-data-amount bill.

The DS managing unit 18 also performs network operations, networkadministration, and/or network maintenance. As at least part ofperforming the network operations and/or administration, the DS managingunit 18 monitors performance of the devices and/or units of the system10 for potential failures, determines the devices and/or unit'sactivation status, determines the devices' and/or units' loading, andany other system level operation that affects the performance level ofthe system 10. For example, the DS managing unit 18 may receive andaggregate network management alarms, alerts, errors, status information,performance information, and messages from the devices 12-14 and/or theDS processing unit 16, storage integrity processing unit 20 and DSNmemory 22. For example, the DS managing unit 18 may receive a simplenetwork management protocol (SNMP) message regarding the status of theDS processing unit 16.

The DS managing unit 18 performs the network maintenance by identifyingequipment within the computing system 10 that needs replacing,upgrading, repairing, and/or expanding. For example, the DS managingunit 18 may determine that the DSN memory 22 requires more DS storageunits 36 or that one or more of the DS storage units 36 needs updating.

The second primary function of distributed data storage and retrievalfunction involves a user device 12-14. For instance, when a second typeof user device 14 has a data file 38 and/or data block 40 to store inthe DSN memory 22, it sends the data file 38 and/or data block 40 to theDS processing unit 16 via its interface 30. As will be described ingreater detail with reference to FIG. 2, the interface 30 functions tomimic a conventional operating system (OS) file system interface (e.g.,network file system (NFS), flash file system (FFS), disk file system(DFS), file transfer protocol (FTP), web-based distributed authoring andversioning (WebDAV), etc.) and/or a block memory interface (e.g., smallcomputer system interface (SCSI), internet small computer systeminterface (iSCSI), etc.). In addition, the interface 30 may attach auser identification code (ID) to the data file 38 and/or data block 40.

The DS processing unit 16 receives the data file 38 and/or data block 40via its interface 30 and performs a distributed storage (DS) processthereon. The DS processing 34 begins by partitioning the data file 38and/or data block 40 into one or more data segments, which isrepresented as Y data segments. For example, the DS processing 34 maypartition the data file 38 and/or data block 40 into a fixed byte sizesegment (e.g., 21 to 2 n bytes, where n=>2) or a variable byte sizesegment (e.g., change byte size from segment to segment, or from groupsof segments to groups of segments, etc.).

For each of the Y data segments, the DS processing 34 error encodes(e.g., forward error correction (FEC), information dispersal algorithm,erasure coding, or error correction coding) and slices (or slices thenerror encodes) the data segment into a plurality of error coded (EC)data slices 42-48, which is represented as X slices per data segment.The number of slices (X) per data segment, which corresponds to a numberof pillars n, is set in accordance with the distributed data storageparameters and the error coding scheme. For example, if a Reed-Solomon(or other FEC scheme) is used in an X/T system, then a data segment Y isdivided into X slices, where T number of slices is needed to reconstructthe original data segment (i.e., T is the threshold). As a few specificexamples, the X/T factor may be 5/3; 6/4; 8/6; 8/5; 16/10.

For each data slice 42-48, the DS processing unit 16 creates a uniqueslice name and appends it to the corresponding slice 42-48. The slicename includes universal DSN memory addressing routing information (e.g.,virtual memory addresses in the DSN memory 22) and user-specificinformation (e.g., user ID, file name, data block identifier, etc.).

The DS processing unit 16 transmits the plurality of EC data slices42-48 to a plurality of DS units 36 of the DSN memory 22 via the DSNinterface 32 and the network 24. The DSN interface 32 formats each ofthe slices for transmission via the network 24. For example, the DSNinterface 32 may utilize an internet protocol (e.g., TCP/IP, etc.) topacketize the slices 42-48 for transmission via the network 24.

The number of DS units 36 receiving the slices 42-48 is dependent on thedistributed data storage parameters established by the DS managing unit18. For example, the DS managing unit 18 may indicate that each slice isto be stored in a different DS storage unit 36. As another example, theDS managing unit 18 may indicate that like slice numbers of differentdata segments are to be stored in the same DS storage unit 36. Forexample, the first slice of each of the data segments is to be stored ina first DS storage unit 36, the second slice of each of the datasegments is to be stored in a second DS storage unit 36, etc. In thismanner, the data is encoded and distributedly stored at physicallydiverse locations to improve data storage integrity and security.Further examples of encoding the data segments will be provided withreference to one or more of FIGS. 2-24.

Each DS storage unit 36 that receives a slice 42-48 for storagetranslates the virtual DSN memory address of the slice into a localphysical address for storage. Accordingly, each DS storage unit 36maintains a virtual to physical memory mapping to assist in the storageand retrieval of data.

The first type of user device 12 performs a similar function to storedata in the DSN memory 22 with the exception that it includes DSprocessing 34. As such, the user device 12 encodes and slices the datafile 38 and/or data block 40 for storage. The user device 12 thentransmits the slices 35 to the DSN memory 22 via its DSN interface 32and the network 24.

For a second type of user device 14 to retrieve a data file or datablock from memory, it issues a read command via its interface 30 to theDS processing unit 16. The DS processing unit 16 performs the DSprocessing 34 to identify the DS storage units 36 storing the slices ofthe data file 38 and/or data block 40 based on the read command. The DSprocessing unit 16 may also communicate with the DS managing unit 18 toverify that the user device 14 is authorized to access the requesteddata.

When the user device is authorized to access the requested data, the DSprocessing unit 16 issues slice read commands to at least a thresholdnumber of the DS storage units 36 storing the requested data (e.g., toat least 10 DS units for a 16/10 error coding scheme). Each of the DSstorage units 36 receiving the slice read command, verifies the command,accesses its virtual to physical memory mapping, retrieves the requestedslice, or slices, and transmits it to the DS processing unit 16.

Once the DS processing unit 16 has received a threshold number T ofslices for a data segment, it performs an error decoding function andde-slicing to reconstruct the data segment. When Y number of datasegments have been reconstructed, the DS processing unit 16 provides thedata file 38 and/or data block 40 to the user device 14. Note that thefirst type of user device 12 performs a similar process to retrieve adata file 38 and/or data block 40.

The storage integrity processing unit 20 performs the third primaryfunction of data storage integrity verification. In one instance, thestorage integrity processing unit 20 periodically retrieves slices 45 ofa data file or data block of a user device 12, 14 to verify that one ormore slices has not been corrupted or lost (e.g., a DS storage unit 36failed). The retrieval process mimics the read process previouslydescribed. In another instance, the storage integrity processing unit 20periodically retrieves integrity data of the slices 45 from theappropriate DS storage units 36. The storage integrity processing unit20 interprets the integrity data to determine if one or more of theslices has a data error or inconsistency (e.g., is corrupted,out-of-date, missing, etc.).

If the storage integrity processing unit 20 determines that one or moreslices has an associated error, it rebuilds the corrupted or lostslice(s) in accordance with the error coding scheme. The storageintegrity processing unit 20 stores the rebuilt slice, or slices, in theappropriate DS storage unit(s) 36 in a manner that mimics the writeprocess previously described.

While the DS processing unit 16, the DS managing unit 18, and thestorage integrity processing unit 20 are shown as separate units, theymay be functional units within one or more other components of thecomputing system 10. For example, the storage integrity processing unit20 may be a distributed function contained with two or more of the DSunits 36; may be a single unit within one of the DS units 36; may bewithin the DS managing unit 18; may be distributed within user devices(e.g., user devices 12) to verify the data of the corresponding user;and/or may be within the DS processing unit 16.

FIG. 2 is a schematic block diagram of an embodiment of a computing core26 that includes a processing module 50, a memory controller 52, mainmemory 54, a video graphics processing unit 55, an input/output (TO)controller 56, a peripheral component interconnect (PCI) interface 58,at least one IO device interface module 62, a read only memory (ROM)basic input output system (BIOS) 64, and one or more memory interfacemodules. The memory interface module(s) includes one or more of auniversal serial bus (USB) interface module 66, a host bus adapter (HBA)interface module 68, a network interface module 70, a flash interfacemodule 72, a hard drive interface module 74, and a DSN interface module76. Note the DSN interface module 76 and/or the network interface module70 may function as the interface 30 of the user device 14 of FIG. 1.Further note that the IO device interface module 62 and/or the memoryinterface modules may be collectively or individually referred to as IOports.

The processing module 50 may be a single processing device or aplurality of processing devices. Such a processing device may be amicroprocessor, micro-controller, digital signal processor,microcomputer, central processing unit, field programmable gate array,programmable logic device, state machine, logic circuitry, analogcircuitry, digital circuitry, and/or any device that manipulates signals(analog and/or digital) based on hard coding of the circuitry and/oroperational instructions. The processing module may have an associatedmemory and/or memory element, which may be a single memory device, aplurality of memory devices, and/or embedded circuitry of the processingmodule. Such a memory device may be a read-only memory, random accessmemory, volatile memory, non-volatile memory, static memory, dynamicmemory, flash memory, cache memory, and/or any device that storesdigital information. Note that if the processing module includes morethan one processing device, the processing devices may be centrallylocated (e.g., directly coupled together via a wired and/or wireless busstructure) or may be distributedly located (e.g., cloud computing viaindirect coupling via a local area network and/or a wide area network).Further note that when the processing module implements one or more ofits functions via a state machine, analog circuitry, digital circuitry,and/or logic circuitry, the memory and/or memory element storing thecorresponding operational instructions may be embedded within, orexternal to, the circuitry comprising the state machine, analogcircuitry, digital circuitry, and/or logic circuitry. Still further notethat, the memory element stores, and the processing module executes,hard coded and/or operational instructions corresponding to at leastsome of the steps and/or functions illustrated in FIGS. 1-24.

FIG. 3 is a schematic block diagram of an embodiment of a storageintegrity processing unit 20 that includes a processing module 50 incomputing core 26 and DSnet interface 32. The processing module 50 isconfigured to implement a grid module 84. The DSnet interface 32 couplesthe processing module 50 to a plurality of DS storage units 36 at one ormore sites. In this example, six DS storage units (storing pillar0-pillar 5) are located at three different sites; pillars 0-1 arelocated at site 1, pillars 2-3 are located at site 2, and pillars 4-5are located at site 3.

In an example of operation, the grid module 84 receives integrity dataregarding one or more pluralities of EC data slices from the DS storageunits 36. The DS storage units 36 may provide the integrity data inresponse to a scan request from the grid module 84 and/or atpredetermined intervals. In this example, a plurality of data slicescorresponds to a data segment. Note that the data segment may be of afixed size (e.g., 1 MByte) or of a variable size and it may represent anentire, or portion of, a data file 38 or data object 40.

The grid module 84 evaluates the received integrity data, which mayinclude a cyclic redundancy check (CRC), hash value, etc. of the naminginformation and/or of the data slices. When the evaluation of thereceived integrity data yields unfavorable results (e.g., one or more ofthe integrity data is not as expected; one of the slices names does notmatch the other slices names because update version is different; thenaming information for one of the slices was not received; and/or theCRC of the naming information was not as expected), the integrity modulerequests naming information of one or more pluralities of data slicesfrom the plurality of DS storage units 36. Note that the naminginformation includes at least a portion of a slice name, wherein theslice name includes a source name (which is described with reference toone or more subsequent figures). After receiving the naming information,the grid module 84 evaluates it to identify at least one data slice ofthe one or more of pluralities of data slices having an associated error(e.g., corrupt naming information, missing slice, out-of-date slice,etc.) to generate an identified data slice for rebuilding. In anotherembodiment, the grid module 84 receives a plurality of data slices fromthe DS storage units 36 and evaluates the data slices to identifywhether one or more of plurality of data slices has an associated error.

The grid module 84 rebuilds the identified data slice(s) having theassociated data error. For instance, the grid module 84 may retrieveerror coded data slices from the DS storage units and rebuild errorcoded data slices therefrom. Rebuilding of slices will be discussed ingreater detail with reference to FIGS. 4 and 5.

FIG. 4 is a schematic block diagram of an embodiment of a grid module 84that includes a control unit 86, a pre-data manipulator 88, an encoder90, a slicer 92, a post-data manipulator 94, a pre-data de-manipulator96, a de-slicer 98, a decoder 100, and a post-data de-manipulator 102.In another embodiment, the control unit 86 is partially or completelyexternal to the grid module 84. For example, the control unit 86 may bepart of the computing core at a remote location, part of a user device12, 14, part of the DS managing unit 18 or distributed amongst one ormore DS storage units 36.

The control unit 86 assists and/or controls the other elements of thegrid module 84 to determine operational parameters, such as the types ofpre-data and post-data manipulation/de-manipulation to be applied to anincoming/outgoing data segments 104, if any, the type of errorencoding/decoding to apply to the (encoded) data segments 106, and theslicing/de-slicing function. In addition, the control unit 86 mayfurther create and maintain a DS storage memory mapping, status of DSstorage units 36, performance history of DS storage units 36, capabilityof DS storage units 36, prioritization information for DS storage unitusage, and rebuilding criteria (e.g., when to rebuild, when to gatherintegrity information, etc.). The control unit 86 may determine theoperational parameters by combining parameters of the associated vaultwith other parameters, which will be discussed below.

In an example of operation, the pre-data manipulator 88 receives a datasegment 104 and a write instruction from an authorized user device 12,14. The control unit 86 or gateway module may assist the pre-datamanipulator 88 to determine the vault for the authorized user and thedata segment 104. When enabled, the pre-data manipulator 88 determinesif pre-manipulation of the data segment 104 is required, and if so, whattype of pre-manipulation. The determination may be based on one or morefactors including a computing system-wide predetermination, a tablelookup, vault parameters associated with the user identification, thetype of data, security requirements, available DSN memory, performancerequirements, and/or other metadata.

The pre-data manipulator 88 manipulates the data segment 104 inaccordance with the manipulation determination, which includes one ormore of compression (e.g., Lempel-Ziv-Welch, Huffman, Golomb, fractal,wavelet, etc.), signatures (e.g., Digital Signature Algorithm (DSA),Elliptic Curve DSA, Secure Hash Algorithm, etc.), watermarking, tagging,encryption (e.g., Data Encryption Standard, Advanced EncryptionStandard, etc.), adding metadata (e.g., time/date stamping, userinformation, file type, etc.), cyclic redundancy check (e.g., CRC32),and/or other manipulations to enhance the value of the data segment 104.Note that the pre-data de-manipulator 102 performs the complementaryfunctions of the pre-data manipulator 88 when data is retrieved from theDSN memory 22. Note that the pre-data manipulator 88 and pre-datade-manipulator 102 are bypassed when data is recovered and reconstructedin the rebuild path.

The encoder 90 receives the data segment 104 from the pre-datamanipulator 88 and encodes the data segment 104 using a forward errorcorrection (FEC) encoding algorithm to produce the encoded data segment106. The encoder 90 determines what type of encoding algorithm to usebased on factors including predetermination in the vault for this userand/or data segment 104, a time based algorithm, user directed, DSmanaging unit directed, as a function of the data type, as a function ofthe data segment metadata, and/or any other factor to determinealgorithm type. The encoder 90 may utilize a different encodingalgorithm for each data segment 104, or the same encoding algorithm forall data segments 104, or some other combination. The encoder 90 maydetermine the encoding algorithm type to be one of Golay,Multidimensional parity, Reed-Solomon, Hamming, Bose Ray ChauduriHocquenghem (BCH), Cauchy-Reed-Solomon, or any other FEC encoder. Theencoded data segment 106 is of greater size than the data segment 104 bythe overhead rate of the encoding algorithm. The encoded data segment106 is d(X/T), where d is size of the data segment 104, X is the width nor number of slices, and T is the threshold or minimum number of slicesto enable reconstruction of the data segment 104.

The corresponding decoding process performed by decoder 98 canaccurately recover the data segment provided it receives a thresholdnumber T or more slices. For example, if X=16 and T=10, then the datasegment 104 will be recoverable, even if 6 EC data slices per segmentare corrupted or missing. Note that the decoder 98 performs thecomplementary functions of the encoder 90 when data is retrieved fromthe DSN memory 22.

The slicer 92 receives the encoded data segment 106 from the encoder 90and transforms the encoded data segment 106 into EC data slices 108 inaccordance with the slicing parameter from the vault for this userand/or data segment 104. In one embodiment, data segments 104 are packedone for one into a data slice. In this instance, it is possible tocorrect many data slices with this method if the error patterns aresubstantially manifested as individual bit errors. In another example ofthis instance, entire slices may be lost and hence entire data segments104 may not be recoverable. In another embodiment, a data segment 104 isdispersed across many data slices (e.g., X wide pillars) to lessen theimpact on a given data segment 104 when an entire data slice is lost.Less data per segment is lost, when a data slice is lost, as the datasegment 104 is dispersed across more slices. The slicing is discussed ingreater detail with reference to FIG. 5. Note that the de-slicer 100performs the complementary functions of the slicer 92 when data isretrieved from the DSN memory 22.

The post-data manipulator 94 receives EC data slices 108 from the slicer92. The post-data manipulator 94 determines if post-manipulation of theEC data slices 108 is required, and if so, what type ofpost-manipulation. The determination may be driven by one or morefactors including a computing system-wide predetermination, parametersin the vault for this user, a table lookup, the user identification, thetype of data, security requirements, available DSN memory, performancerequirements, and/or other metadata. The post-data manipulator 94manipulates the EC data slices 108 in accordance with the manipulationdetermination. The manipulation may include one or more of slice levelcompression, signatures, encryption, CRC, addressing, watermarking,tagging, adding metadata, and/or other manipulation to improve theeffectiveness of the computing system. The post-data manipulator 94passes the resulting EC data slices for storage in the DSN memory 22.Note that the post-data de-manipulator 96 performs the complementaryfunctions of the post-data manipulator 94 when data is retrieved fromthe DSN memory 22.

In an example of operation, the grid module 84 performs a rebuildoperation for an identified data slice with an associated error. Theidentified data slice is one of a number X of data slices generated froma data segment. The grid module 84 retrieves at least a threshold numberT of the X data slices of the data segment. The grid module 84 mayretrieve vault parameters based on a vault identifier contained in theslice name, wherein the vault parameters include information regardingthe type of post-data manipulation, the slicing/de-slicing function, andthe encoding/decoding function. Based on these parameters, the retrievedEC data slices 112 shown in FIG. 4 are post-data de-manipulated and thenare de-sliced to generate encoded data segment 116. The encoded datasegment 116 is decoded to produce a reconstructed data segment 118. Thereconstructed data segment 118 is then encoded and sliced to generate arebuilt data slice corresponding to the identified data slice.

FIG. 5 is a diagram of an example embodiment of error coded data slicecreation wherein the slicer 92 creates four EC data slices from athirty-two bit encoded data segment. The slicer 92 disperses the bitsfrom the encoded data segment across the EC data slices wrapping aroundfrom the last slice to the first slice over and over (i.e., interleavesthe bits among the slices). Each EC data slice, for this data segment,is stored on a different DS storage unit 36. In this example, encodeddata segment bits 0, 4, 8, 12, 16, 20, 24, and 28 form EC data slice 1;encoded data segment bits 1, 5, 9, 13, 17, 25, and 29 form EC data slice2; encoded data segment bits 2, 6, 10, 14, 18, 22, 26, and 30 form ECdata slice 3; and encoded data segment bits 3, 7, 11, 15, 19, 23, 27,and 31 form EC data slice 4. In a 4/3 system (a width of 4 pillars and aread threshold of 3), one EC data slice can be lost and the data segmentcan still be accurately recovered. Note that more slices produce alarger distance between consecutive encoded data segment bits of aslice, which improves the error resiliency.

FIG. 6 is a schematic block diagram of an embodiment of DS processingmodule 34 of user device 12 and/or of the DS processing unit 16. The DSprocessing module 34 includes a gateway module 120, an access module122, a grid module 84, a storage module 124, and a bypass/feedback path126. The DS processing module 34 may also include an interface 32 andthe DSnet interface 34 or the interfaces 32 and 34 may be part of user12, 14 or of the DS processing unit 16.

In an example of storing data, the gateway module 120 of the DSprocessing module 34 receives an incoming data object 132 with an objectname 130 and user ID 128 (e.g., a data file, a data block, an EC dataslice, etc.), authenticates the user associated with the data object,obtains user information of the authenticated user, and assigns a sourcename 134 to the data object 132 in accordance with the user information.The gateway module 120 determines the source name 134 based on the vaultidentifier and the data object 132. For example, the source name 134 maycontain a data name (block number or a file number), the vaultgeneration number, a reserved field, and a vault identifier. The dataname may be randomly assigned but is associated with the user dataobject.

To authenticate the user, the gateway module 120 verifies the user ID128 with the DS managing unit 18 and/or another authenticating unit. Ifthe user ID 128 is verified, the gateway module 120 retrieves the userinformation from the DS managing unit 18, the user device 12, 14 and/orthe other authenticating unit based on the user ID.

The user information includes a vault identifier, operationalparameters, and user attributes (e.g., user data, billing information,etc.). A vault identifier identifies a vault, which is a virtual memoryspace that maps to a set of DS storage units 36. For example, vault 1(i.e., user 1's DSN memory space) includes eight DS storage units (X=8wide) and vault 2 (i.e., user 2's DSN memory space) includes sixteen DSstorage units (X=16 wide). The operational parameters may include anerror coding algorithm, the width n (number of pillars X or slices persegment for this vault), a read threshold T, an encryption algorithm, aslicing parameter, a compression algorithm, an integrity check method,caching settings, parallelism settings, and/or other parameters that maybe used to access the DSN memory layer.

The gateway module 120 may utilize the bypass/feedback path 126 totransfer an incoming EC data slice to another DS storage unit 36 whenthe DS processing module 34 determines that the EC data should betransferred.

The access module 122 receives the data object 132 and creates a seriesof data segments 1 through Y therefrom. The number of segments Y may bechosen or random based on a selected segment size and the size of thedata object. For example, if the number of segments is chosen to be afixed number, then the size of the segments varies as a function of thesize of the data object. For instance, if the data object is an imagefile of 4,194,304 eight bit bytes (e.g., 33,554,432 bits) and the numberof segments Y=131,072, then each segment is 256 bits or 32 bytes. Asanother example, if segment sized is fixed, then the number of segmentsY varies based on the size of data object. For instance, if the dataobject is an image file of 4,194,304 bytes and the fixed size of eachsegment is 4,096 bytes, the then number of segments Y=1,024. Note thateach segment is associated with the source name.

The grid module 84, as previously discussed, may pre-manipulate (e.g.,compression, encryption, cyclic redundancy check (CRC), etc.) the datasegment before creating X error coded data slices for each data segment.The grid module 84 creates XY error coded data slices for the Y datasegments of the data object. The grid module 84 adds forward errorcorrection bits to the data segment bits in accordance with an errorcoding algorithm (e.g., Reed-Solomon, Convolution encoding, Trellisencoding, etc.) to produce an encoded data segment. The grid module 84determines the slice name and attaches the unique slice name to each ECdata slice.

The number of pillars, or slices X per data segment (e.g., X=16) ischosen as a function of the error coding objectives. The DS processingmodule 34 may utilize different error coding parameters for EC dataslices based on guidance from one or more of a user vault (e.g., storedparameters for this user), a command from the DS managing unit 18 orother system element, priority of the EC data slice, type of data in theEC data slice, and/or retrieval speed requirements. A read threshold T(e.g., T=10) of the error coding algorithm is the minimum number oferror-free error coded data slices required to be able to reconstruct adata segment. The DS processing unit 34 can compensate for X−T (e.g.,16−10=6) missing, out-of-date, and/or corrupted error coded data slicesper data segment.

The grid module 84 receives each data segment 1—Y and, for each datasegment generates X number of error coded (EC) slices using an errorcoding function. The grid module 84 also determines the DS storage units36 for storing the EC data slices based on a dispersed storage memorymapping associated with the user's vault and/or DS storage unit 36attributes, which include availability, self-selection, performancehistory, link speed, link latency, ownership, available DSN memory,domain, cost, a prioritization scheme, a centralized selection messagefrom another source, a lookup table, data ownership, and/or any otherfactor to optimize the operation of the computing system. A slice name136 is then appended to the EC data slices. For example, the slice name134 may contain universal routing information, vault specificinformation, slice index, vault identifier, vault generation number, areserved field, and a vault identifier.

The storage module 124 may perform integrity checks on the EC dataslices and then transmit the EC data slices 1 through X of each segment1 through Y to the DS storage units 36. The DS storage units 36 maystore the EC data slices and locally keep a table to convert virtual DSNaddresses into physical storage addresses. In an embodiment, the numberof DS storage units 36 is equal to or greater than the number of pillars(slices X per segment) so that no more than one error coded data sliceof the same data segment is stored on the same DS storage unit 36.Further note that EC data slices of the same pillar number but ofdifferent segments (e.g., EC data slice 1 of data segment 1 and EC dataslice 1 of data segment 2) may be stored on the same or different DSstorage units 36.

In an example of a read operation, the user device 12 or 14 sends a readrequest to the DS processing module 34, which authenticates the request.When the request is authentic, the DS processing module 34 sends a readmessage to each of the DS storage units 36 storing slices of the dataobject being read. The slices are received via the DSnet interface 34and processed by the storage module 124, which performs a parity checkand provides the slices to the grid module 84. The grid module 84de-slices and decodes the slices of a data segment to reconstruct thedata segment. The access module 122 reconstructs the data object fromthe data segments and the gateway module 120 formats the data object fortransmission to the user device.

FIG. 7 is a schematic block diagram of an embodiment of a file systemhierarchy including a plurality of user virtual memories, a segment andslice directory 140, a virtual dispersed storage network (DSN) addressto physical location table 142, and a physical dispersed storage network(DSN) memory 146. The file system hierarchy may be utilized to translatethe user virtual memory system to the physical DSN memory 146 bytranslating the user virtual memory address into a virtual dispersedstorage network (DSN) address space 148 and then to the physical DSNmemory 146. The segment and slice directory 140 includes the virtual DSNaddress space 148 and the physical DSN memory 146 includes a pluralityof DS storage units 36 (e.g., A, C, D, and F). In an example, wherethere are four pillars, there are four slices (X=4) created for each ofthe Y data segments. Pillars can be allocated to more than one DSstorage unit, but a given DS storage unit is not generally assigned tostore more than one pillar from a given user (or vault) to improvesystem robustness (e.g., avoiding loss of multiple slices as a result ofa single DS storage unit failure).

In an embodiment, one of the plurality of user virtual memories 152 a-nutilizes a native OS file system to access the segment and slicedirectory 140 by including source name information in requests such asread, write, delete, list, etc. A source name vault identifier and afile/block name may index into the segment and slice directory 140 todetermine the virtual DSN address space 148. A unique virtual vault isassociated with each user (e.g., an individual, a group of individuals,a business entity, a group of business entities, etc.) and may containuser attributes (e.g., user identification, billing data, etc.),operational parameters, and a list of the DS storage units that may beutilized to support the user. One or more vaults may be established fromthe same set of DS storage units in different combinations. A vaultidentifier is utilized to distinguish between vaults. For example, vault#1 (for user 1) may utilize DS storage units A, C, D, and F (X=4 wide)while vault #2 (user 2) may utilize DS storage units A-H (X=8 wide)(note that DS units B, E, G, and H are not shown).

In an example, the total virtual DSN address space 148 is defined by aforty-eight byte identifier thus creating 25648 possible slice names.The virtual DSN address space 148 accommodates addressing of EC dataslices corresponding to segments of data objects (e.g., data file,blocks, streams) over various generations and vaults. The slice name isa virtual DSN address and remains the same even as different DS storageunits are added or deleted from the physical DSN memory 146.

A user has a range of virtual DSN addresses assigned to their vault,user virtual memory 152 a-n. For instance, the virtual DSN addressestypically do not change over the operational lifespan of the system forthe user. In another instance, the virtual DSN address space 148 isdynamically altered from time to time to provide such benefits asimproved security and expansion, retraction, and/or capability. Avirtual DSN address space 148 security algorithm may alter the virtualDSN address space 148 according to one or more of a command (e.g., fromthe DS managing unit 18), a schedule, a detected security breach, or anyother trigger. The virtual DSN address may also be encrypted in use thusrequiring encryption and decryption steps whenever the virtual DSNaddress is used.

The vault and file name index used to access the virtual DSN addressspace 148 and to create the slice names (virtual DSN addresses) may alsobe used as an index to access the virtual DSN address to physicallocation table 142. For example, the virtual DSN address to physicallocation table 142 is sorted by vaults and pillars so that subsequentaddresses are organized by pillar of the file segments that have EC dataslices with the same slice identifier and hence are typically stored atthe same DS storage unit (e.g., slices having a first pillar identifierare stored in DS storage unit A). The output of the access to thevirtual DSN address to physical location table 142 is the DS storageunit identifiers.

The slice names may be used as the virtual index to the memory system ofeach DS storage unit to gain access the physical location of the EC dataslices. In this instance, the DS storage unit maintains a local tablecorrelating slice names (virtual DSN address) to the addresses of thephysical media internal to the DS storage unit. For example, user number1 has a vault identified operational parameter of four pillars andpillar 0 is mapped to DS storage unit A, pillar 1 is mapped to DSstorage unit C, pillar 2 is mapped to DS storage unit D, and pillar 3 ismapped to DS storage unit F.

FIG. 8 is a schematic block diagram of another embodiment of a storageintegrity processing unit 20 that includes processing module 50 andDSnet interface 32. The processing module 50 implements grid module 84.To detect for slices having a data inconsistency, the grid module 84scans EC data slices stored at DS storage units 36. For example, thegrid module 84 may scan six pillars of EC data slices for segments 1 toY of a data object.

In an embodiment, the grid module 84 detects three major types of dataerrors: slice failure, storage unit failure, and site failure. For aslice failure (illustrated at DS storage unit 2), the grid module 84rebuilds the slice. For a DS storage unit failure (illustrated at DSstorage unit 3), the grid module 84 rebuilds the slices stored withinthe DS storage unit and stores the rebuilt slices in an available DSstorage unit. For a site failure where one or more DS storage unitsoperate (illustrated at site 3 where DS storage units 5 and 6 may beoffline), the grid module 84 rebuilds the data slices stored at the siteand stores the rebuilt slices at an available site.

In an embodiment, depending on a type of error, the decision to rebuildmay be delayed until after a predetermined period of time. Thepredetermined time period is based on an estimate for correcting thetype of error. In another embodiment, depending on the number X of dataslices from the data segment that are recoverable, the rebuilding may beimmediately performed rather than delayed for the predetermined timeperiod. For example, the rebuilding of data slices at site 3 would beginwithout waiting a predetermined time period since the site contains twoof the six pillars in a 6/4 system and any further loss of slices atanother site would render the data segment unrecoverable.

FIG. 9 is a logic flow diagram of an embodiment of a method 200 for datarebuilding in response to a type of error. In step 202, grid module 84detects an error associated with an EC data slice. In an embodiment, thegrid module 84 periodically scans EC data slices to detect data errorsregarding a data object. The grid module 84 receives integrity dataregarding one or more pluralities of EC data slices from the DS storageunits 36. The DS storage units 36 may provide the integrity data inresponse to a request from the integrity module 85 and/or atpredetermined intervals. In another embodiment, the grid module 84detects a storage unit failure or site failure. The grid module 84 mayreceive a status update from the storage units or sites or from the DSmanaging unit 18 or may determine a status from responses or lackthereof from the DS storage units 36 or sites.

Next the grid module 84 identifies the data slice for rebuilding in step204. In an embodiment, the grid module 84 requests naming information ofone or more pluralities of data slices from the plurality of DS storageunits 36. For a storage unit failure or site failure, the grid module 84requests naming information from DS processing unit 15, user device 12,14 or DS managing unit 18. The naming information includes at least aportion of a slice name. After receiving the naming information, thegrid module 84 evaluates it to identify the data slice with anassociated error (e.g., corrupt naming information, missing slice,out-of-date slice, etc.) to generate an identified data slice forrebuilding. The grid module 84 then rebuilds the identified data slicein response to a type of error in step 206. The rebuilding of the dataslices in accordance with the type of error is discussed further withrespect to FIGS. 10-12.

FIG. 10 is a logic flow diagram of an embodiment of a method 210 fordata rebuilding in response to a type of error. An address range ofencoded data slices is scanned in step 212 and one or more errors aredetected that are associated with the data slices, in step 214. In step216, it is determined whether the type of error is temporary. Forexample, a storage unit or site failure may be temporary, e.g. due to anetwork connectivity problem, software problem or power outage. In anembodiment, when the type of error is temporary, a predetermined timeperiod lapses prior to rebuilding to determine whether the failure iscorrected.

In another embodiment, when the type of error is temporary, anavailability of the other data slices from the data segment isdetermined in step 218. In an embodiment, the number X of EC data slicesstored for a data segment is compared with a number A of available dataslices for the data segment in step 220. Assuming a minimum thresholdnumber T of EC data slices are required to rebuild a data segment, whenthe difference between the number of slices X and available slices A(X−A) compares favorably to the threshold number T (e.g. X−A is greaterthan T), then the data segment may still be rebuilt in case one or moreadditional data slices become unavailable. Thus, waiting to rebuilduntil after a predetermined time period is performed. However, when thedifference between the number of slices X and available slices A doesnot compare favorably (e.g. X−A is equal to T), then rebuilding isperformed as shown in step 222 rather than delayed for the predeterminedtime period. In another embodiment, an availability of the other dataslices from the data segment is determined by comparing a number E ofdata slices with an associated error from the data segment. Depending onthe number X of data slices in comparison to the number E ofunrecoverable data slices (e.g. E<X−T), the rebuilding is performedrather than delayed for the predetermined time period.

The predetermined time period may vary depending on the type of errorand estimated time to correct the type of error. For example, for astorage unit or site failure, a network connectivity error may beprovided a shorter predetermined time period than a power outage.

After or during the predetermined time period, the availability of theidentified data slice is re-evaluated to determine whether theassociated error has been corrected in step 226. When the associatederror is corrected, the scan continues for other errors in step 230.When the error is not corrected after the predetermined time period, theidentified data slice is rebuilt. In another embodiment, the processreturns to step 218 to determine availability of the other X data slicesfor the data segment. The process may continue to wait one or morepredetermined time periods before rebuilding as long as sufficient dataslices are available for recovery of the data segment in the event of anadditional failure.

FIG. 11 is a logic flow diagram of another embodiment of a method 240for data rebuilding in response to a type of error when the type oferror is a slice error. The slice error may involve just one slice or aplurality of data slices, e.g. the same pillar slices for more than onedata segment. In step 242, an error is detected associated with anencoded data slice that is determined to be a slice error in step 244.The slice error may result from a corrupted data, from a missing slice,or from a version update error (e.g., failed to successfully store amore recent version). When the slice error includes data corruption instep 246, the corrupted slice is rebuilt from at least a thresholdnumber T of the other X slices of the data segment and the rebuilt sliceis restored on the same DS storage unit or another available DS storageunit.

When the slice error is not a result of a corrupted slice, the methodcontinues to step 250 where it is determined whether a data slice ismissing. For example, when less than the number X of expected dataslices are found for a data segment, it is determined that one or moredata slices are missing. When a data slice is missing, the methodcontinues at step 252 where it is determined whether the missing sliceis a temporary type of error. The determination is based on whether theerror temporarily prevents retrieval of the data slice, e.g., a DSstorage unit is temporarily down for updates or repair or network istemporarily down to the DS storage unit, rather than permanentlyprevents recovery of the data slice, e.g. data slice is not saved orerased due to failures. When the missing slice is a temporary condition,a predetermined period of time is set to resolve the error in step 252.After or during the predetermined time period, it is determined whetherthe error is resolved in step 254. For example, the missing data sliceis now available because, e.g. the DS storage unit returns online ornetwork connectivity issues are resolved. When the missing error iscorrected within the predetermined period of time, the process iscomplete for this particular slice error as shown in step 256. However,when the predetermined period of time expires prior to the error beingresolved or the error is not a temporary type of error, the methodproceeds to step 258 in which the grid module 84 rebuilds the missingslice and re-stores it on the same DS storage unit or another availableDS storage unit.

When the slice error is not a missing slice, the method continues tostep 260 wherein the grid module 84 determines whether the sliceincludes a version update error. The determination may be made, e.g., bycomparing the version of other slices for the same segment or byaccessing the user vault to determine a version for the slice name. Whenthe slice has a correct version, the method repeats at step 244. Whenthe slice error includes a version update error, the method continues atstep 262 where the grid module 84 rebuilds the slice and re-stores it onthe same or another available DS storage unit.

FIG. 12 is a logic flow diagram of another embodiment of a method 280for data rebuilding in response to a type of error when the type oferror is detected at a pillar level. In step 282, an error is detectedassociated with an encoded data slice that is determined to be at apillar level in step 284. The pillar data error may be a result ofeither or both of a DS storage unit failure or a site failure. In step286, the grid module 84 determines whether a DS storage unit failure hasoccurred. A DS storage unit failure is indicated by, e.g., corruptionerrors in a plurality of data slices stored at a DS storage unit 36, noresponse by a DS storage unit 36 (e.g., powered off, network down,maintenance mode), a scheduled DS storage unit outage, and/or numerousmissing EC data slices. The DS managing unit 18 may schedule DS storageunit outages from time to time to test the rebuilding process or to havecertain data slices stored at a DS storage units rebuilt and stored atanother DS storage unit, e.g. to upgrade to a new storage unit.

When a storage unit failure is detected in step 286, it is determinedwhether the DS storage unit failure is a temporary type of error in step288. The determination is based, e.g., on a maintenance indicator (e.g.,the DS storage unit is temporarily down for updates or repair), or anetwork connectivity indicator (e.g., the network is temporarily down tothe DS storage unit) or status update from the DS storage unit 36 or DSmanaging unit 18. When the site failure is a temporary type of error,the process delays a predetermined amount of time in step 290 prior torebuilding. When the error is not corrected after the predeterminedamount of time or the error is not temporary, the grid module 84rebuilds the data slices stored on the failed storage unit and restoresthe slices on another available DS storage unit 36 in step 294 at thesame site or a different site. When the storage unit failure iscorrected within the predetermined period of time, the process iscomplete for this particular slice error as shown in step 296.

Continuing at step 298, the process detects whether a site failure hasoccurred. In some instances, a storage unit failure is due to a sitefailure. The determination of a site failure is indicated, e.g., by amaintenance indicator (e.g., DS storage units at a site are temporarilydown for updates or repair), a network connectivity indicator (e.g., thenetwork is temporarily down to the site), or a scheduled site outage orstatus update or nonresponsive storage units at a site (e.g., naturaldisaster). The DS managing unit 18 may schedule DS site outages fromtime to time to test the rebuilding process or to have data slicesstored at a site rebuilt and stored at another site, e.g. to optimizewhere data slices are stored or to relocate a storage center.

When a site failure occurs, the process continues to step 288 todetermine whether the site failure is a temporary condition. Thedetermination may be based on the maintenance indicator (e.g., the DSstorage unit is temporarily down for updates or repair), the networkconnectivity indicator (e.g., the network is temporarily down to the DSstorage unit), or the scheduled site outage. When the error is nottemporary or the site failure is not corrected after a predeterminedtime period, the data slices stored on DS storage units 36 at the siteare rebuilt and stored on one or more available DS storage units 36 atanother site. When no storage unit or site failure has occurred, themethod repeats at step 284.

FIG. 13 is a schematic block diagram of another embodiment of gridmodule 84 for rebuilding one or more data slices. The grid module 84includes a rebuild module 302 and control unit 74. The control unit 74identifies data slices for rebuilding while the rebuild module 302rebuilds the identified data slices. The control unit 74 may alsocoordinate functions and sequencing of activities of the rebuild module302, including encoder 90, slicer 92, post-data manipulator 94,post-data de-manipulator 96, de-slicer 98, and decoder 100.

In an example of operation, pillar 2 slices are missing from a group ofsix pillars. The control unit 74 retrieves data slices from thecompanion pillars and provides the recovered data slices 304 to therebuild module 302. At least a threshold T of data slices (e.g., T=readthreshold) from other pillars must be retrieved to rebuild the pillar 2data slices. The post-data de-manipulator 96 performs any requiredde-manipulation (e.g., CRC) as described in more detail with referenceto FIG. 4 to generate post data de-manipulated slices 306 though in anembodiment, the rebuild module 302 does not perform data de-manipulationor manipulation on the data slices. The de-slicer 98 de-slices post datade-manipulated slices 306 with the missing slice filled with anycombination of zeros and ones to generate encoded data segment 308. Thedecoder 100 decodes encoded data segment 308 utilizing the decodingalgorithm specified for this vault and data type to generatereconstructed data segment 310.

Encoder 90 encodes the reconstructed data segment 310 to producere-encoded data segment 312 based on the encoding algorithm specifiedfor this vault. The slicer 92 slices the re-encoded data segment 312 toproduce pre-data manipulated data slices 314. The slicer 92 mayreproduce all of the slices or just the slice for the missing pillar.The post-data manipulator 94 manipulates (e.g., CRC) the data slices toproduce the rebuilt data slices 316 corresponding to the identifiedmissing data slices. The grid module 84 stores the reconstructed slicein the appropriate DS storage unit according to the virtual DSN addressto physical DS storage table.

In another example of operation, the rebuild module 302 receives therecovered data slices 302 and the de-slicer 98 deslices the data slicesto generate encoded data segment 308. The encoded data segment 308 isthen transmitted to the slicer 92 which reslices it and generates therebuilt data slices 316. The rebuild module 302 does not perform datade-manipulation or manipulation on the data slices. In addition, therebuild module 302 does not perform decoding and encoding on the encodeddata segment 308 in this embodiment.

FIG. 14 is a logic flow diagram of an embodiment of a method 340 forrebuilding a data slice generated from a data segment. An identificationof an encoded data slice for rebuilding is received by the rebuildmodule 84 in step 342. The grid module 84 retrieves at least a thresholdT of data slices needed to reconstruct the data segment in step 344. Thegrid module 84 reconstructs the data segment in step 346 and generates arebuilt encoded data slice from the reconstructed data segment in step348.

FIG. 15 is a schematic block diagram of an embodiment of a control unit74 of the grid module 84. The control unit 74 includes one or morescanning agents 350, a rebuild queue 352, a rebuild agent 354, a slicequeue 356 and a slice agent 358. For efficient rebuild scanning, thenumber of scanning agents varies depending on the size of the virtualDSN addressing space 148. For instance, if the DSN addressing space 148is relatively small, then a single scanning agent 350 may be sufficientto communicate with the DS storage units 36 to identify slices that needrebuilding. As the DSN addressing space 148 increases, it may be moreefficient to divide the DSN addressing space 148 among two or more ofthe scanning agents 350. Then a scanning agent 350 communicates with DSstorage units 36 associated with its range of the DSN addressing space148.

In an example of operation, a scanning agent 350 communicates with oneor more DS storage units 36 associated with its portion of the DSNaddressing space 148 to receive integrity data or slices for scanning.When the scanning agent 350 detects an error in a data slice, it storesthe slice name or other identification of the identified data slice 360with an associated error into the rebuild queue 352. The rebuild agent354 retrieves slice names from the rebuild queue 354 to initiate therebuilding process by the rebuild module 302. The rebuild agent 162receives the rebuilt data slice 316 and stores the rebuilt data slice316 or an identification thereof into the slice queue 356. The sliceagent 358 retrieves the rebuilt data slices from the slice queue 356 andstores them to an available DS storage unit 36.

The scanning function of the scanning agents 350 may be centralized ormay be distributed among other system elements (e.g., to reduce networktraffic) including one or more of the storage integrity processing unit20, the DS storage units 36, the DS managing unit 18, the DS processingunit 16, or the user device 12, 14 as described further herein. Theoperation of scanning agents 350 is further described with respect toFIGS. 16-19.

FIG. 16 is a logic flow diagram of an embodiment of a method 380 forscanning an encoded data slice. In step 382, scanning agent 350 receivesa scanning address range assignment which includes an address range ofone or more pillars within a vault from one or more of the DS processingunit 16, the DS managing unit 18, the storage integrity processing unit20, and/or the DS storage units 36. In another embodiment, the gridmodule 84 may determine to scan DS storage units based on a lookup intothe virtual DSN address to physical location table 142 and/or based on avirtual address range assignment for the grid module 84. Thedetermination of the scanning address range assignment will be discussedin more detail with reference to FIG. 24. In step 384, the scanningagent determines an encoded data slice has an associated error type. Inan embodiment, the scanning agent determines multiple pillars have anassociated error, e.g. missing an entire segment of slices or even allthe slices for that pillar. The scanning agent 350 identifies the dataslices with errors in step 386 and stores identification, e.g. the slicenames, of the slices with associated errors in the rebuild queue 352 instep 388.

FIG. 17 is a logic flow diagram of another embodiment of a method 390for determining a missing data slice error during a scan of data slices.In step 392, the scanning agent 350 scans an address range of one ormore pillars within a vault. In step 394, the scanning agent 350determines whether a data slice is missing. For example, the scanningagent 350 may request the DS storage units 36 to provide a list of slicenames within an address range. The request may include a starting slicename (DSN virtual address) and a count of slice names to include in thelist (count may be zero or greater). The scanning agent 350 receives aslice name list for slices that should be stored within the addressrange and compares the slice name list with the list of slices receivedfrom the DS storage units 36. In another example, the scanning agent 350checks sequential slice names for a data segment and determines whetherone of the sequential slices is not present at a pillar. Thedetermination may also be based on a comparison of data slices thatshould be present in one pillar based on the slice names present in thecompanion pillars. In step 396, the scanning agent 350 identifies themissing data slices and places the slice names or other identificationof the data slices in the rebuild queue 352 so that they may besubsequently rebuilt and re-stored. The scan continues in step 398 whenno errors are detected.

FIG. 18 is a logic flow diagram of another embodiment of a method 400for determining a data corruption error during a scan of data slices. Instep 402, the scanning agent 350 scans an address range of one or morepillars within a vault. As part of the scanning, the scanning agentchecks integrity data stored for each of a plurality of data slices inthe address range in step 404. In an embodiment, when a data slice isinitially stored, the DS storage units 36 also store integrity data foreach EC data slice. The integrity data may be a CRC, a hash, a paritycheck or other data validity function for a data slice. For example, theDS storage units 36 append a CRC to each EC data slice when the slice isinitially stored. The integrity data may be calculated as well fromoverhead included in the data slice, such as the slice name and versioninformation. The scanning agent 350 then recalculates the integrity dataand compares it to the stored integrity data. The scanning agent 350determines whether the integrity data comparison matches. When the dataverification fails, the scanning agent 350 determines that a datacorruption error has occurred in step 406. In step 408, the scanningagent 350 identifies the data slices with data corruption and places theslice names or other identification of the data slices in the rebuildqueue 352 so that they may be subsequently rebuilt and re-stored. Thescan continues in step 410 when no errors are detected.

FIG. 19 is a logic flow diagram of another embodiment of a method 420for determining a version update error during a scan of data slices. Instep 422, the scanning agent 350 scans an address range of one or morepillars within a vault and determines a version for a data slice in theaddress range in step 424. In step 426, the scanning agent 350determines whether the data slice is an appropriate version based on theuser vault or version number from the other slices for the data segment.The determination may be made, e.g., by comparing the version of otherslices for the same segment or by accessing the user vault to determinea version for the slice name. When the data slice does not have acurrent version in step 428, the scanning agent 350 identifies the dataslice and places the slice names or other identification of the dataslices in the rebuild queue 352 so that the data slice may besubsequently rebuilt and re-stored. The scan continues in step 430 whenno errors are detected.

FIG. 20 is a logic flow diagram of an embodiment of a method 440 ofoperation of the rebuild agent 354. The rebuild agent 354 selects a dataslice from the rebuild queue 352 for rebuilding in step 442. The rebuildagent 354 selects the data slice in a first in first out (FIFO) order oran order based on a prioritization algorithm in step 446. Theprioritization algorithm may operate to speed the recovery of keymissing data slices and/or may be based on a priority indicator for thedata object, a priority indicator for the user, a priority indicator forthe data object type (e.g., always recover banking records ahead of homevideo), slice age (e.g., which is the most outdated), and/or any otherpriority indicator to provide timely recovery of the most crucial and/orvaluable data. In an embodiment, the rebuild agent 354 retrieves atleast a threshold number T of data slices from the data segment neededto rebuild the data slice in step 448. The rebuild module 302 rebuildsthe data slice using the at least T data slices. The rebuild agent 354receives the rebuilt data slice in step 448 and stores the rebuilt dataslice or an identification thereof into the slice queue 356 in step 450.

FIG. 21 is a logic flow diagram of an embodiment of a method 460 ofoperation of the slice agent 358. In step 462, the slice agent 358selects a rebuilt data slices from the slice queue 356 for storage to anavailable DS storage unit 36. The order in which the slice agent 358selects rebuilt slices 316 may be a first in first out (FIFO) order oran order based on a prioritization algorithm. The prioritizationalgorithm may operate to speed the recovery of key missing data slicesand/or may be based on a priority indicator for the data object, apriority indicator for the user, a priority indicator for the dataobject type (e.g., always recover banking records ahead of home video),slice age (e.g., which is the most outdated), and/or any other priorityindicator to provide timely recovery of the most crucial and/or valuabledata. In step 466, the slice agent 358 determines one of the DS storageunits 36 for storing the rebuilt encoded data slice and determineswhether the DS storage unit 36 is available in step 468. When it is notavailable, the process continues to step 466 to determine another DSstorage unit 36 is available. In another embodiment, the slice agent 358re-queues the slice in the slice queue 356. When the DS storage unit isavailable, the slice agent 358 determines whether the rebuilt data sliceis the appropriate version based on the user vault or version numberfrom the other slices for the data segment in step 470. When the versionis not current, the slice agent 358 re-queues the slice name in therebuild queue 352 in step 472 so that the rebuild agent 354 will rebuildthe data slice with the appropriate version. When the version iscurrent, the slice agent 358 stores the data slice in the available DSstorage unit in step 474.

In an embodiment, the control unit 74 may be partially or completelyexternal to the grid module 84. For example, the control unit 74 may bepart of a computing core 26 at a remote location, part of a user device12, 14, part of the DS managing unit 18, or distributed amongst one ormore DS storage units 36 as described further herein. For example, thescanning function may be centralized or it may be distributed amongstsystem elements including one or more of the DS storage units 36, the DSmanaging unit 18, the DS processing unit 34, or the user devices 12, 14.

FIG. 22A is a schematic block diagram of an embodiment of a distributedcontrol unit 74. In this embodiment, a DS storage unit 36 includes oneor more scanning agents 350 and a rebuild queue 352. A centralizedcontrol unit 74 is located in a storage integrity processing unit 20 orother unit such as DS managing unit 18. In an example of operation, theone or more scanning agents 350 implemented in DS storage unit 36 areassigned a scanning address range. The scanning address range mayinclude data slices stored on the DS storage unit 36 as well as dataslices stored at other DS storage units 36. When the scanning agent 350in DS storage unit 36 detects an error, the scanning agent 350 placesthe slice name or other identification of the data slice in rebuildqueue 352 in the DS storage unit 36. In an embodiment, the rebuild agent354 in the storage integrity processing unit 20 accesses the rebuildqueue in the DS storage unit 36 to select data slices for rebuilding. Inanother embodiment, the rebuild queue 352 is implemented in the storageintegrity processing unit 20, and the scanning agent in the DS storageunit 36 stores the slice name with an associated error in the rebuildqueue 352 in the storage integrity processing unit 20.

In an embodiment, the grid module 84, including the rebuild module 302and control unit 74, may be distributed, in whole or in part, among thestorage integrity processing unit 20, the DS managing unit 18, the userdevices 12,14 or distributed amongst one or more DS storage units 36.For example, the scanning function of the control unit 74 may becentralized or it may be distributed amongst other system elements.Similarly, the rebuild function of the grid module 84 may be centralizedor it may be distributed amongst other system elements, such as thestorage integrity processing unit 20, a DS processing unit 16 and DSmanaging unit 18. In another embodiment, the grid module 84, includingthe rebuild module 302 and the control unit 74 are located in one ormore of the plurality of DS storage units 36.

FIG. 22B is a schematic block diagram of another embodiment of adistributed control unit 74. In this embodiment, a plurality of DSstorage units 36 include a consistency agent 480. The consistency agent480 scans the locally stored data slices, recalculates integrity datafor the local data slices and compares integrity data stored for thedata slices with the recalculated integrity data. Thus, the consistencyagents 480 perform checks on locally stored data slices to determinedata corruption errors, as described with respect to FIG. 18. When aconsistency agent 480 in a DS storage unit 36 detects an error, theconsistency agent 480 places the slice name or other identification ofthe data slice in rebuild queue 352 in the storage integrity processingunit 20. In another embodiment, the consistency agent 480 transmits theidentification of the data slice to the scanning agent 350 in thestorage integrity processing unit 20 for storing in the rebuild queue352. In an embodiment, the scanning agent 350 in the storage integrityprocessing unit 20 performs scans across multiple DS storage units 36 todetermine missing slice errors (as described with respect to FIG. 18)and version update errors (as described with respect to FIG. 19) whilethe consistency agents 480 in the DS storage units 36 perform scans todetermine data corruption errors on locally stored data slices.

FIG. 23 illustrates a schematic block diagram of an embodiment of adistributed grid module 84. In this example, the scanning function,control functions and rebuild function of the grid module 84 aredistributed amongst one or more of the DS storage units 36 and thestorage integrity processing unit 20. At site 1, DS storage unit 1includes a scanning agent 350 while at site 2 both DS storage unit 3 and4 include a consistency agent 480. In site 3, DS storage unit 5 includesa control unit 74 while DS storage unit 6 includes a grid module 84 withboth a rebuild module 302 and a control unit 74 functions.

In an example of operation, DS storage units 1, 2, 3, 4, 5, 6 share atleast one common address range in a virtual DSN address space for acompanion set of pillars of at least one common vault. DS storage unit 1is assigned to scan a particular subset of the common address range fordata errors in data slices stored locally and across DS storage units2,3,4,5,6. DS storage unit 1 issues a scan request for integrity dataover LAN to DS storage unit 2 at the same site and over network 24 tothe other DS storage units 3,4,5,6. When DS storage unit 1 receives thescan responses from DS storage units 2,3,4,5,6, the scanning agent 350determines whether data errors are present based on the responses. Theerrors may include one or more of corrupted slices, missing slices, DSstorage unit failures, and/or site failures.

When data errors are detected by scanning agent 350 in DS storage unit1, a slice name or other identification of data slices with associatederrors is transmitted to the grid module 84 in the storage integrityprocessing unit 20 for rebuilding. In another embodiment, the DS storageunit 1 transmits a slice name or other identification of data sliceswith associated errors to grid module 84 in DS storage unit 6 forrebuilding. In another embodiment, DS storage unit 1 includes a rebuildqueue 352 and stores a slice name or other identification of data sliceswith associated errors in its rebuild queue 352. A rebuild agent 354 ingrid module 84 at storage integrity processing unit 20 or at DS storageunit 6 access the rebuild queue in the DS storage unit 36 to select dataslices for rebuilding.

When the scanning function of a grid module 84 is distributed amongstthe DS storage units, scanning of data slices can be distributed aswell. For example, each DS storage unit with a scanning function can beassigned a portion of an address range to distribute the processingload. In another example, the scanning agent 350 in the DS storage units36 perform scans across multiple DS storage units 36 to determinemissing slice errors (as described with respect to FIG. 18) and versionupdate errors (as described with respect to FIG. 19) while consistencyagents 480 in the DS storage units 36 perform scans to determine datacorruption errors on locally stored data slices.

FIG. 24 is a schematic block diagram of an embodiment of distributedscanning address range assignments. A dispersed storage memory mappingis shown that specifies virtual DSN address ranges 0-8 by pillar mappedto physical DS storage units A,B,C,D,E,F,G,H,I,J,K,L,M that storeinformation for those address ranges. In this example, the addressranges 0-8 include the virtual DSN addresses assigned to a vault λ. Theindividual addresses within each address range may specify a unique fileidentifier within that vault. The letter designation in each pillarsignifies the physical DS storage unit 36 that is assigned to store dataslices for those address ranges. For example, DS storage unit A isresponsible for storing data slices corresponding to pillar 0 for DSNaddresses ranges 0-4 and DS storage unit J is responsible for storingdata slices corresponding to pillar 0 for DSN addresses ranges 5-8.Pillars 0-5 for the same address range will contain the EC data slicesfor stored data segments. For example, DS storage units A, B, D, E, F,and H store data slices with an address range 0 corresponding to pillars0-5 for the same data segments.

The memory mapping specifies scanning address range assignments bycompanion sets of pillars within the same address ranges. The scanningprocess for address range 0 may include scans of pillar 0-5 slices in DSstorage units A, B, D, E, F, and H since they form the companion pillarsfor the same data segments. For example, DS storage unit A is assignedto scan address range 0 in DS storage units A, B, D, E, F, and H and DSstorage unit J is assigned to scan address range 6 in DS storage unitsJ, C, K, L, G and I. In another embodiment, it is also possible toconsolidate some of the scanning ranges. For example, DS storage unit Dmay scan address ranges 3 and 4 as one range across DS storage units A,C, D, L, G, and H instead of sharing part of that task with DS storageunit L. In a similar way, DS storage unit M may scan address ranges 7and 8 as one range across DS storage units J, C, K, L, M, and I insteadof sharing part of that task with DS storage unit K.

The scanning address range assignments may be predetermined and staticor may be altered from time to time as a function of one or more of newDS storage unit additions, storage growth, a load sharing algorithm, analgorithm to exercise the scanning responsibilities, a new networkconfiguration, a new plurality of DS storage unit clusters at one site,and/or other changes that may affect scanning efficiency andeffectiveness.

Various examples have described a centralized approach to rebuilding adata slice wherein at least a threshold number T of data slices neededto rebuild the data slice are transmitted to a rebuild function at onelocation, e.g. a grid module 84 at storage integrity processing module20. This centralized approach requires network bandwidth from each DSstorage unit 36 transmitting one of the at least threshold number T ofdata slices, even when some of the DS storage units 36 are located atthe same site. In another embodiment, the slice rebuilding processincludes a de-centralized approach wherein DS storage units 36 thatstore one of the at least threshold number T of data slices eachsequentially compute a portion of the data needed to produce the rebuiltdata slice. The de-centralized approach is discussed in more detail withreference to FIGS. 25-33.

FIG. 25 is a schematic block diagram of an embodiment of a dispersedstorage system 500 with de-centralized slice rebuilding. The dispersedstorage system 500 includes a plurality of DS storage units 36 at aplurality of sites. In this example, DS storage units 1 and 2 are atsite 1, DS storage units 3 and 4 are at site 2, and DS storage units 5and 6 are at site 3. Each of the DS storage units 36 include a partialrebuild grid module 502. The partial rebuild grid module 502 includes apost data demanipulator 96, partial decoder 504 and partial encoder 506.In an embodiment, the partial rebuild grid module 502 also includesfunctionality to reconstruct a data segment from at least a thresholdnumber T of data slices in a centralized rebuilding process.

In the partial rebuilding process, a data slice is rebuilt by combiningslice partials generated from at least a threshold number T of dataslices in any order (e.g., adding the slice partials individually oradding in one or more subsets). In an example of operation, a slicefailure at DS storage unit 3 is identified by partial rebuild gridmodule 3 and the slice name or other identification of the data slicewith an associated error is determined for the identified data slice.When the identified data slice is selected for rebuilding, the gridmodule 3 determines at least a threshold number T of data slices fromthe same data segment needed to rebuild the identified data slice.

In the example, DS storage unit 1 stores one of the threshold number Tof data slices, i.e. EC data slice 1_0. DS storage unit 1 retrieves ECdata slice 1_0 and post-data de-manipulator 96 performs any requireddata de-manipulation on EC data slice 1_0. The partial decoder performsa decode function on EC data slice 1_0 to generate a partially decodedportion of the data segment. The partial encoder encodes the partiallydecoded portion of the data segment to produce a partially encodedportion of the data segment, e.g. slice partial (SP1). The partialdecode and partial encode steps involve finite field arithmetic for theerror control scheme and will be discussed in greater detail withreference to FIGS. 28-31. DS storage unit 2 also performs a partialdecode step followed by a partial encode step to produce slice partialSP2 from the second slice EC data slice 1_1. The slice partial SP1 iscombined with slice partial SP2 to produce first summation S12. Thesummation of slice partials includes, for example, typical arithmeticaddition, a finite field summation operation, and/or a bit-wiseexclusive-OR logical operation.

Similarly DS storage unit 5 performs a partial decode step followed by apartial encode step to produce slice partial SP5 from the EC data slice1_4, and DS storage unit 6 performs a partial decode step followed by apartial encode step to produce a slice partial (SP6) from the EC dataslice 1_5. The slice partial SP5 is combined with slice partial SP6 toproduce second summation S56. DS storage unit 4 performs a partialdecode step followed by a partial encode step to produce a slice partial(SP4) from the EC data slice 1_3. SP4 is then combined with firstsummation S12, second summation S56 to generate a partial slice sum 510.The rebuilt EC data slice 1_2 is then generated from the partial slicesum 510. For example, post data manipulation may need to be performed onpartial slice sum 510 to generate the rebuilt EC data slice 1_2.

The slice partials in the partial rebuilding process may be combined inany order to generate the partial slice sum. For example, in FIG. 25 ata first level, SP1 and SP2 may be combined and SP5 and SP6 may becombined before those two combinations are combined with SP4. In anotherexample, the combination of SP1 and SP2 from site 1 may be sent to site3 where the SP1 and SP2 combination is combined with the combination ofSP5 and SP6. The combination of SP1, 2, 5, 6 is sent to site 2 wherethat combination is combined with SP4 to produce the rebuilt EC dataslice 1_2.

The sequencing of combining the slice partials in the partial rebuildingprocess may be determined by the storage integrity processing unit 20,DS managing unit 18, one of the DS storage units 36 and/or DS processing34. The determination may be based on where the failure occurred, thenetwork topology, the loading level of the DS storage units, which DSstorage units are clustered together at the same sites sharing thecommon LAN, and/or any other factor to improve the efficiency of therecovery. Two sequencing approaches include a ring sequencing and a starsequencing. A ring sequencing begins with one site that generates slicepartials and passes the results to the next site until the site with theerror receives the results of the other sites. In a star sequencing,each site generates slice partials and passes the results to the sitewith the error. The star sequencing and ring sequencing are described ingreater detail with reference to FIGS. 26 and 27.

FIG. 26 is a schematic block diagram of another embodiment of adispersed storage system for partial rebuilding using star sequencing. Aplurality of DS storage units 36 each include a partial rebuild gridmodule 502. LANs 530 couple DS storage units 36 located at the same sitewhile WAN 540 couples DS storage units 36 at different sites. WAN 540 isincluded for example as a part of network 24 in FIG. 1.

In this example, star sequencing for slice rebuilding is shown. DSstorage unit 1 receives partial SP2 from DS storage unit 2 over the LAN530 a and combines slice partial SP2 with slice partial SP1 to generatefirst summation SP12. The DS storage unit 1 transmits the firstsummation SP12 to DS storage unit 3. DS storage unit 5 receives slicepartial SP6 from DS storage unit 6 over LAN 530 c and combines slicepartial SP6 with slice partial SP5 to generate second summation SP56. DSstorage unit 3 receives second summation SP56 from DS storage unit 5. DSstorage unit 3 receives slice partial SP4 over LAN 530 b from DS storageunit 4. DS storage unit 3 combines first summation SP12 and secondsummation SP56 and slice partial SP4 to generate the rebuilt data slice.The rebuilt data slice is restored on DS storage unit 3 or anotheravailable storage unit.

FIG. 27 is a schematic block diagram of another embodiment of adispersed storage system for partial rebuilding using ring sequencing.In the example, DS storage unit 1 receives slice partial SP2 from DSstorage unit 2 over LAN 530 a and combines slice partial SP2 withpartial SP1 to produce summation SP12. DS storage unit 1 sends the firstsummation SP12 to DS storage unit 5. DS storage unit 5 receives slicepartial SP6 from DS storage unit 6 over LAN 530 c and combines slicepartial SP6 with slice partial SP5 and summation SP12 to producesummation SP1256. DS storage unit 3 receives summation SP1256 from DSstorage unit 5 and also receives slice partial SP4 over LAN 530 b fromDS storage unit 4. DS storage unit 3 combines summation SP1256 withslice partial SP4 to generate the rebuilt data slice.

When slice partials are combined at a site over a LAN 530, the partialrebuilding process requires less transmissions over the WAN 540 from thecentralized rebuilding method. Though a ring sequence and a starsequence are described with respect to the partial rebuilding process,other sequences, such as a combination of a ring and star sequence, mayalso be implemented.

FIGS. 28 through 31 illustrate an embodiment for the partial rebuildingprocess. In the example in FIGS. 28-31, a missing encoded data slicefrom pillar 3 is rebuilt utilizing a star approach similar to theexample in FIG. 26. In the example, a data segment is separated into a Xpillars wherein X=6 and the threshold number T equals 4 pillars suchthat at least four data slices of the six data slices are needed torebuild a missing slice. The example will illustrate utilizing a dataslice from pillars 1, 2, 4, and 5 to reconstruct the missing pillar 3data slice.

FIG. 28 illustrates a schematic block diagram of an embodiment of thepartial rebuilding process at DS storage unit 1. DS storage unit 1receives a partial rebuild request that requests partial rebuilding ofan identified data slice S3 with an associated error, e.g. the missingpillar 3 data slice. The rebuild request may identify the encoded dataslice S1 stored at DS storage unit 1 from the same data segment and theidentified data slice S3 with an associated error. The encoded dataslice S1 is one of at least T required data slices needed to reconstructthe data segment. The post-data de-manipulator 96 performs any requireddata de-manipulation on the slice S1. In addition, in an embodiment, adeslicer 98 reorders the data bits, if necessary, to generate a portionof encoded data segment 550.

The partial rebuilding process includes generating a matrix A, matrix A′and matrix S′ by the partial decoder 504 and partial encoder 506 in DSstorage unit 1. Matrix A is generated by preferably first recreatingapproximately the same matrix used to derive the initial data slicesfrom the data segment. For example, in an embodiment, matrix A isdeterministically constructed using a special type of matrix called aVandermond matrix. In a Vandermond matrix, each row is unique andlinearly independent. Other types of matrices may also be used whichhave unique and linearly independent rows. The matrix A will have anumber of rows equal to the number X of pillars and the number ofcolumns equal to the threshold number T of required data slices neededto reconstruct the data segment. The X×T matrix A is thus generated tobe approximately the same as the matrix used to derive the original dataslices.

To generate A′, certain rows are deleted from matrix A to generate asquare matrix. For example, only a threshold number T of slices isneeded to regenerate the data segment. So a number of rows equal to X−Tare deleted to generate a square T×T matrix with T number of rows and Tnumber of columns. In an embodiment, one of the X−T rows that aredeleted includes the row corresponding to the missing slice. Once theT×T matrix is created, the inverse of this square matrix is calculatedto generate the T×T matrix A′.

To generate vector S′, the encoded data segment 550 is placed as a firstelement, corresponding to slice 1, to generate an X×1 vector. Then, thesame rows deleted in matrix A to generate matrix A′ are also deleted togenerate a T×1 vector S′. In the example provided in FIGS. 28-31, therows deleted in matrix A and vector S′ are row 3 corresponding to themissing slice and the last row corresponding to slice 6. For graphicalillustration, these rows 3 and 6 are shown as blank in matrix A′ andvector S′ in FIGS. 28-31. To more clearly show the calculations,symbolic letters are inserted into matrix A′ rather than the calculatedelements for the inverse matrix.

In the next step, the portion of the encoded data segment 550 isreceived by the partial decoder 504. The partial decoder 508 multipliesT×T matrix A′ with T×1 vector S′ to generate a portion of decoded datasegment 552, vector d=aS1, bS1, dS1, eS1. The partial encoder 506multiplies only a row of matrix A corresponding to the missing slicewith vector d. In this example, row 3 corresponding to missing slice 3of matrix A is multiplied with vector d to generate encoded slicepartial 554 for missing pillar 3 from pillar 1, e.g.SP3,1=9aS1+10bS1+11dS1+12eS1.

FIG. 29 a schematic block diagram of an embodiment of the partialrebuilding process at DS storage unit 2. DS storage unit 2 generates anencoded slice partial SP3,2 from pillar 2, slice S2 which is one of atleast the number T required data slices needed to reconstruct the datasegment. DS storage unit 2 receives a partial rebuild request thatrequests partial rebuilding of an identified data slice S3 with anassociated error, e.g. the missing pillar 3 data slice. The rebuildrequest may identify the encoded data slice S2 and the identified dataslice S3 with an associated error. The post-data de-manipulator 96performs any required data de-manipulation on the slice S2. In addition,in an embodiment, a deslicer 98 reorders the data bits, if necessary, togenerate a portion of encoded data segment 550. The encoded data segment550 is placed as a second element, corresponding to slice 2, in an X×1vector and then row 3 corresponding to the missing slice and the lastrow corresponding to slice 6 are deleted to generate T×1 vector S′.

As explained above, matrix A and matrix A′ are generated by the partialdecoder 504 and partial encoder 506 in DS storage unit 2. The partialdecoder 508 multiplies T×T matrix A′ with T×1 vector S′ to generate aportion of decoded data segment 552, vector d=gS2, hS2, jS2, kS2. Thepartial encoder 506 multiplies only a row of matrix A corresponding tothe missing slice with vector d. In this example, row 3 corresponding tomissing slice 3 of matrix A is multiplied with vector d to generateencoded slice partial 554 for missing pillar 3 from pillar 2, e.g.SP3,2=9gS2+10hS2+11jS2+12kS2.

In this example, one of the DS storage units at site 1, such as DSstorage unit 1 or 2, combines SP3,1 and SP3,2 to generate the summationSP3,1+SP3,2. The DS storage unit then transmits the summationSP3,1+SP3,2 to site 2. In another embodiment, the slice partials can becombined with other slice partials in other sequences and orders untilthe threshold number T of slice partials have been summed to generatethe rebuilt data slice.

FIG. 30 a schematic block diagram of an embodiment of the partialrebuilding process at DS storage unit 5. DS storage unit 5 generates anencoded slice partial SP3,5 from pillar 5, slice S5 which is one of atleast the number T required data slices needed to reconstruct the datasegment. DS storage unit 5 receives a partial rebuild request thatrequests partial rebuilding of an identified data slice S3 with anassociated error, e.g. the missing pillar 3 data slice. The rebuildrequest may identify the encoded data slice S5 and the identified dataslice S3 with an associated error. The post-data de-manipulator 96performs any required data de-manipulation on the slice S5. In addition,in an embodiment, a deslicer 98 reorders the data bits, if necessary, togenerate a portion of encoded data segment 550. The encoded data segment550 is placed as a fifth element, corresponding to slice 5, in an X×1vector and then row 3 corresponding to the missing slice and the lastrow corresponding to slice 6 are deleted to generate T×1 vector S′.

As explained above, matrix A and matrix A′ are generated by the partialdecoder 504 and partial encoder 506 in DS storage unit 5. The partialdecoder 508 multiplies T×T matrix A′ with T×1 vector S′ to generate aportion of decoded data segment 552, vector d=sS5, tS5, vS5, wS5. Thepartial encoder 506 multiplies only a row of matrix A corresponding tothe missing slice with vector d. In this example, row 3 corresponding tomissing slice 3 of matrix A is multiplied with vector d to generateencoded slice partial 554 for missing pillar 3 from pillar 5, e.g.SP3,5=9sS5+10tS5+11vS5+12wS5. DS storage unit 5 transmits partial resultSP3,5 to site 2.

FIG. 31 a schematic block diagram of an embodiment of the partialrebuilding process at DS storage unit 4. DS storage unit 4 generates anencoded slice partial SP3,4 from pillar 4, slice S4 which is one of atleast the number T required data slices needed to reconstruct the datasegment. DS storage unit 4 receives a partial rebuild request thatrequests partial rebuilding of an identified data slice S3 with anassociated error, e.g. the missing pillar 3 data slice. The rebuildrequest may identify the encoded data slice S4 and the identified dataslice S3 with an associated error. The post-data de-manipulator 96performs any required data de-manipulation on the slice S4. In addition,in an embodiment, a deslicer 98 reorders the data bits, if necessary, togenerate a portion of encoded data segment 550. The encoded data segment550 is placed as a fourth element, corresponding to slice 4, in an X×1vector and then row 3 corresponding to the missing slice and the lastrow corresponding to slice 6 are deleted to generate T×1 vector S′.

As explained above, matrix A and matrix A′ are generated by the partialdecoder 504 and partial encoder 506 in DS storage unit 5. The partialdecoder 508 multiplies T×T matrix A′ with T×1 vector S′ to generate aportion of decoded data segment 552, vector d=mS4, nS4, pS4, qS4. Thepartial encoder 506 multiplies only a row of matrix A corresponding tothe missing slice with vector d. In this example, row 3 corresponding tomissing slice 3 of matrix A is multiplied with vector d to generateencoded slice partial 554 for missing pillar 3 from pillar 4, asSP3,4=9mS4+10nS4+11pS4+12qS4.

DS storage unit 3 receives the results and adds summation SP3,1+SP3,2(from site 1) with slice partial SP3,5 (from site 3) with slice partialSP3,4 (from site 2) to generate the rebuilt slice S3 for pillar 3. DSstorage unit 3 stores the rebuilt slice S3 in DS storage unit 3 oranother available storage unit. When DS storage unit 3 is not available,another DS storage unit or storage integrity processing unit 20 mayreceive the results and generate the rebuilt slice S3 for pillar 3.

The example of the partial rebuilding process in FIGS. 28-31 requirestwo WAN transmissions (e.g., SP3,1+SP3,2 from site 1 and SP3,5 from site3). A centralized rebuilding approach in this example would require fourWAN transmissions to transmit four of the threshold number T of dataslices from remote DS storage units to storage integrity processing unit20 and then another WAN transmission to send the rebuilt data slice fromthe storage integrity processing unit 20 to the DS storage unit 36 for atotal of five WAN transmission. As such, the partial rebuilding approachdescribed herein decreases the number of WAN transmissions lowering thenetwork bandwidth utilization compared to a centralized rebuildingapproach.

FIG. 32 illustrates a logic flow diagram of an embodiment of a method560 for a partial rebuilding. An encoded data slice is identified forrebuilding at a DS storage unit 36 in step 562. The identified dataslice is one of X data slices generated from a data segment using anerror encoding dispersal function. The DS storage unit 36 receives oneor more sums of at least a threshold number T of encoded slice partialsin step 564. The encoded slice partials are generated from acorresponding one of a plurality of the encoded data slices. The DSstorage unit 36 then generates the rebuilt encoded data slicecorresponding to the identified data slice from the one or more sums ofat least the number T of encoded slice partials in step 566.

FIG. 33 illustrates a logic flow diagram of another embodiment of amethod 580 for partial rebuilding. In step 582, a DS storage unit 36receives a partial rebuild request from another DS storage unit 36 or inanother embodiment from storage integrity processing unit 20 or DSmanaging unit 18 or user device 12, 14 that includes for example, anidentification of an identified data slice for rebuilding. The requestmay also include an identification of an encoded data slice stored atthe DS storage unit 36 from the same data segment, wherein the encodeddata slice is one of a threshold number T of data slices required toreconstruct the data segment. The DS storage unit 36 generates a slicepartial from the one of a threshold number T of data slices required toreconstruct the data segment in step 584. The DS storage unit 36 thentransmits the slice partial to the requesting unit or other identifieddestination in step 586.

As may be used herein, the terms “substantially” and “approximately”provides an industry-accepted tolerance for its corresponding termand/or relativity between items. Such an industry-accepted toleranceranges from less than one percent to fifty percent and corresponds to,but is not limited to, component values, integrated circuit processvariations, temperature variations, rise and fall times, and/or thermalnoise. Such relativity between items ranges from a difference of a fewpercent to magnitude differences. As may also be used herein, theterm(s) “coupled to” and/or “coupling” and/or includes direct couplingbetween items and/or indirect coupling between items via an interveningitem (e.g., an item includes, but is not limited to, a component, anelement, a circuit, and/or a module) where, for indirect coupling, theintervening item does not modify the information of a signal but mayadjust its current level, voltage level, and/or power level. As mayfurther be used herein, inferred coupling (i.e., where one element iscoupled to another element by inference) includes direct and indirectcoupling between two items in the same manner as “coupled to”. As mayeven further be used herein, the term “operable to” indicates that anitem includes one or more of power connections, input(s), output(s),etc., to perform one or more its corresponding functions and may furtherinclude inferred coupling to one or more other items. As may stillfurther be used herein, the term “associated with”, includes directand/or indirect coupling of separate items and/or one item beingembedded within another item. As may be used herein, the term “comparesfavorably”, indicates that a comparison between two or more items,signals, etc., provides a desired relationship. For example, when thedesired relationship is that signal 1 has a greater magnitude thansignal 2, a favorable comparison may be achieved when the magnitude ofsignal 1 is greater than that of signal 2 or when the magnitude ofsignal 2 is less than that of signal 1.

The present invention has also been described above with the aid ofmethod steps illustrating the performance of specified functions andrelationships thereof. The boundaries and sequence of these functionalbuilding blocks and method steps have been arbitrarily defined hereinfor convenience of description. Alternate boundaries and sequences canbe defined so long as the specified functions and relationships areappropriately performed. Any such alternate boundaries or sequences arethus within the scope and spirit of the claimed invention.

The present invention has been described above with the aid offunctional building blocks illustrating the performance of certainsignificant functions. The boundaries of these functional buildingblocks have been arbitrarily defined for convenience of description.Alternate boundaries could be defined as long as the certain significantfunctions are appropriately performed. Similarly, flow diagram blocksmay also have been arbitrarily defined herein to illustrate certainsignificant functionality. To the extent used, the flow diagram blockboundaries and sequence could have been defined otherwise and stillperform the certain significant functionality. Such alternatedefinitions of both functional building blocks and flow diagram blocksand sequences are thus within the scope and spirit of the claimedinvention. One of average skill in the art will also recognize that thefunctional building blocks, and other illustrative blocks, modules andcomponents herein, can be implemented as illustrated or by discretecomponents, application specific integrated circuits, processorsexecuting appropriate software and the like or any combination thereof.

The invention claimed is:
 1. A storage integrity processing unit in adistributed storage network, comprises: a memory including a rebuildqueue that stores a list of data slices for rebuilding; and at least onerebuild module utilizing processing hardware operable to: select one ofthe list of data slices from the rebuild queue based on a priority of aselected data slice associated with the select one of the list of dataslices, wherein the selected data slice is one of a number of aplurality of encoded data slices of an encoded data segment; reconstructthe encoded data segment from at least a threshold number of the numberof the plurality of encoded data slices of the encoded data segment togenerate a reconstructed data segment; and generate a rebuilt encodeddata slice corresponding to the selected data slice from thereconstructed data segment.
 2. The storage integrity processing unit ofclaim 1, further comprising: a network interface for interfacing with aplurality of storage units in the storage network; and at least onescanning agent operable to: scan an address range of encoded data slicesstored in the plurality of storage units; and identify an encoded dataslice having an address within the address range for rebuilding togenerate an identified data slice.
 3. The storage integrity processingunit of claim 2, wherein the address range of encoded data slicescorresponds to a portion of a virtual DSN (dispersed storage network)addressing space.
 4. The storage integrity processing unit of claim 3,wherein the portion of the virtual DSN addressing space is a portion ofa user vault, wherein the user vault includes a virtual DSN addressspace associated with a user device.
 5. The storage integrity processingunit of claim 3, wherein the portion of the virtual DSN addressing spacecorresponds to a portion of at least one pillar of a user vault, whereinthe user vault includes a virtual DSN address space associated with auser device and wherein a number of pillars of the user vault equals thenumber of encoded data slices of an encoded data segment for the uservault set in accordance data storage parameters and an error codingscheme.
 6. The storage integrity processing unit of claim 1, wherein theat least one rebuild module is further operable to: determine a slicename of the selected data slice, wherein the slice name includes a vaultidentifier that identifies a user vault from a physical address table;and store the slice name of the identified selected slice in the rebuildqueue as one of the list of data slices for rebuilding.
 7. The storageintegrity processing unit of claim 1, wherein the encoded data segmentis one of a plurality of encoded data segments of a data object andwherein the priority is associated with the data object.
 8. The storageintegrity processing unit of claim 7, wherein the priority associatedwith the data object includes at least one of: a priority indicator forthe data object, a priority indicator of a user associated with the dataobject, a priority indicator for a data object type, or a priorityindicator based on a data slice age.
 9. The storage integrity processingunit of claim 1, wherein the threshold number corresponds to a thresholdnumber of the number of the plurality of encoded data slices needed toreconstruct the encoded data segment based on an error encodingdispersal function, wherein the number of the plurality of encoded dataslices of the encoded data segment is equal to a threshold number of thenumber of the plurality of encoded data slices.
 10. The storageintegrity processing unit of claim 9, wherein the at least one rebuildmodule is operable to reconstruct the encoded data segment from at leastthe threshold number of the plurality of encoded data slices of by:decoding at least the threshold number of the plurality of encoded dataslices using a decoding matrix in accordance with an error encodingdispersal function.
 11. The storage integrity processing unit of claim10, wherein the at least one rebuild module is operable to decode atleast the threshold number of the plurality of encoded data slices usinga decoding matrix by: deslicing at least the threshold number of theplurality of encoded data slices to generate a portion of an encodeddata segment; and multiplying the portion of the encoded data segmentwith the decoding matrix, wherein the decoding matrix is an M×R matrix,wherein the decoding matrix includes a number R of rows equal to thenumber of the plurality of encoded data slices and includes a number Mof columns equal to the threshold number of the plurality of encodeddata slices needed to reconstruct the data segment based on the errorencoding dispersal function.
 12. A device in a storage networkcomprising: a network interface for interfacing with a plurality ofstorage units in the storage network; a memory storing operationalinstructions and a rebuild queue that stores a list of data slices forrebuilding; and at least one rebuild module utilizing processingcircuitry configured to execute the operational instructions, whereinthe operational instructions cause the processing circuitry to: selectone of the list of data slices from the rebuild queue based on apriority of a selected data slice associated with the select one of thelist of data slices, wherein the selected data slice is one of a numberof a plurality of encoded data slices of an encoded data segment;reconstruct the encoded data segment from at least a threshold number ofthe number of the plurality of encoded data slices of the encoded datasegment to generate a reconstructed data segment; and generate a rebuiltencoded data slice corresponding to the selected data slice from thereconstructed data segment.
 13. The device of claim 12, furthercomprising at least one scanning agent operable to: scan an addressrange of encoded data slices stored in the plurality of storage units;identify an encoded data slice having an address within the addressrange for rebuilding to generate an identified data slice.
 14. Thedevice of claim 13, wherein the address range of encoded data slicescorresponds to a portion of a virtual DSN (dispersed storage network)addressing space.
 15. The device of claim 14, wherein the portion of thevirtual DSN addressing space is a portion of a user vault, wherein theuser vault includes a virtual DSN address space associated with a userdevice.
 16. The device of claim 14, wherein the portion of the virtualDSN addressing space corresponds to a portion of at least one pillar ofa user vault, wherein the user vault includes a virtual DSN addressspace associated with a user device and wherein a number of pillars ofthe user vault equals the number of encoded data slices of an encodeddata segment for the user vault set in accordance data storageparameters and an error coding scheme.
 17. A method comprising:selecting one of a list of data slices from a rebuild queue based on apriority of a selected data slice associated with the select one of thelist of data slices, wherein the selected data slice is one of a numberof a plurality of encoded data slices of an encoded data segment;reconstruct the encoded data segment from at least a threshold number ofthe number of the plurality of encoded data slices of the encoded datasegment to generate a reconstructed data segment; and generate a rebuiltencoded data slice corresponding to the selected data slice from thereconstructed data segment.
 18. The method of claim 17, furthercomprising: scanning an address range of encoded data slices stored in aplurality of storage units; and identifying an encoded data slice havingan address within the address range for rebuilding to generate anidentified data slice.
 19. The method of claim 18, wherein the addressrange of encoded data slices corresponds to a portion of a virtual DSN(dispersed storage network) addressing space.
 20. The method of claim19, wherein the portion of the virtual DSN addressing space is a portionof a user vault, wherein the user vault includes a virtual DSN addressspace associated with a user device.